منابع مشابه
Maximum graphs with a unique minimum dominating set
We present a conjecture on the maximum number of edges of a graph that has a unique minimum dominating set. We verify our conjecture for some special cases and prove a weakened version of this conjecture in general. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملAn Optimal Algorithm to Find Maximum Independent Set and Maximum 2-Independent Set on Cactus Graphs
A cactus graph is a connected graph in which every block is either an edge or a cycle. An optimal algorithm is presented here to find a maximum independent set and maximum 2-independent set on cactus graphs in O(n) time, where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, specially in radio communication system.
متن کاملMaximum graphs with unique minimum dominating set of size two
We prove that the maximum number of edges of a graph of order n which has a unique minimum dominating set of size two is bounded above by ( n−2 2 ) . As a corollary to this result, we prove a conjecture by Fischermann, Rautenbach and Volkmann that the maximum number of edges of a graph which has a unique minimum dominating set of size two is ( n−2 2 ) .
متن کاملThe Maximum Independent Set Problem in Subclasses of Subcubic Graphs
The Maximum Independent Set problem is NP-hard and remains NP-hard for graphs with maximum degree three (also called subcubic graphs). In our talk we will study its complexity in hereditary subclasses of subcubic graphs. Let A r q be the graph consisting of an induced cycle C q and an induced path with r edges having an endvertex in common with the C q , where A 1 4 is known as the banner. Our ...
متن کاملRectangular polyomino set weak (1, 2)-achievement games
In a polyomino set (1,2)-achievement game the maker and the breaker alternately mark one and two previously unmarked cells respectively. The maker's goal is to mark a set of cells congruent to one of a given set of polyominoes. The breaker tries to prevent the maker from achieving his goal. The teams of polyominoes for which the maker has a winning strategy is determined up to size 4. In set ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2016
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1857